//English description is not available for the problem. Please switch to Chinese
//. Related Topics 堆 分治算法 
// 👍 238 👎 0


package leetcode.editor.cn;
//Java：最小的k个数  LCOF
 class P剑指Offer40ZuiXiaoDeKgeShuLcof{
    public static void main(String[] args) {
        Solution solution = new P剑指Offer40ZuiXiaoDeKgeShuLcof().new Solution();
        // TO TEST
    }
    //leetcode submit region begin(Prohibit modification and deletion)
class Solution {
    public int[] getLeastNumbers(int[] arr, int k) {
        return null;
    }
}
//leetcode submit region end(Prohibit modification and deletion)

}